2-clique-bond of stable set polyhedra
نویسندگان
چکیده
The 2-bond is a generalization of the 2-join where the subsets of nodes that are connected on each shore of the partition are not necessarily disjoint. If all the subsets are cliques we say that the 2-bond is a 2-clique-bond. We consider a graph G obtained as the 2-clique-bond of two graphs G1 and G2 and we study the polyhedral properties of the stable set polytope associated with this graph. In particular, we prove that a linear description of the stable set polytope of G is obtained by properly composing the linear inequalities describing the stable set polytopes of four graphs that are related to G1 and G2. We show how to apply the 2-clique-bond composition to provide the complete linear description of large classes of graphs.
منابع مشابه
Computing the clique number of a-perfect graphs in polynomial time
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Grötschel, Lovász and Schrijver 1981). This result relies on polyhedral characterizations of perfect graphs involving the stable set polytope of the graph, a linear relaxation defined by clique constraints, and a semi-definite relaxation, the Theta-body of the gr...
متن کاملComposition of stable set polyhedra
Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph minus an edge and use the new theorem to derive a class of facets. 1 Preliminaries and Introduction Let G = (V, E) be a simple undirected graph. A set S ⊆ V of pairwise nonadjacent vertices defines a stable set. Let S...
متن کاملThe Intersection of Knapsack Polyhedra and Extensions
This paper introduces a scheme of deriving strong cutting planes for a general integer programming problem. The scheme is related to Chvatal-Gomory cutting planes and important special cases such as odd hole and clique inequalities for the stable set polyhedron or families of inequalities for the knapsack polyhedron. We analyze how relations between covering and incomparability numbers associat...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملPropriétés géométriques du nombre chromatique : polyèdres, structures et algorithmes. (Geometric properties of the chromatic number : polyhedra, structure and algorithms)
Computing the chromatic number and finding an optimal coloring of a perfect graph can be done efficiently, whereas it is an NP-hard problem in general. Furthermore, testing perfection can be carriedout in polynomial-time. Perfect graphs are characterized by a minimal structure of their stable set polytope: the non-trivial facets are defined by clique inequalities only. Conversely, does a simila...
متن کامل